A Simple Derivation of Newton-Cotes Formulas with Realistic Errors
نویسنده
چکیده
In order to approximate the integral I( f ) = ∫ b a f (x)dx, where f is a sufficiently smooth function, models for quadrature rules are developed using a given panel of n (n ≥ 2) equally spaced points. These models arise from the undetermined coefficients method, using a Newton’s basis for polynomials. Although part of the final product is algebraically equivalent to the well known closed Newton-Cotes rules, the algorithms obtained are not the classical ones. In the basic model the most simple quadrature rule Qn is adopted (the so-called left rectangle rule) and a correction Ẽn is constructed, so that the final rule S n = Qn + Ẽn is interpolatory. The correction Ẽn, depending on the divided differences of the data, might be considered a realistic correction for Qn, in the sense that Ẽn should be close to the magnitude of the true error of Qn, having also the correct sign. The analysis of the theoretical error of the rule S n as well as some classical properties for divided differences suggest the inclusion of one or two new points in the given panel. When n is even it is included one point and two points otherwise. In both cases this approach enables the computation of a realistic error ĒS n for the extended or corrected rule S n. The respective output (Qn, Ẽn, S n, ĒS n) contains reliable information on the quality of the approximations Qn and S n, provided certain conditions involving ratios for the derivatives of the function f are fulfilled. These simple rules are easily converted into composite ones. Numerical examples are presented showing that these quadrature rules are useful as a computational alternative to the classical Newton-Cotes formulas.
منابع مشابه
Derivation of Numerical Methods Using Computer Algebra
The use of computer algebra systems in a course on scientific computation is demonstrated. Various examples, such as the derivation of Newton’s iteration formula, the secant method, Newton–Cotes and Gaussian integration formulas, as well as Runge–Kutta formulas, are presented. For the derivations, the computer algebra system Maple is used.
متن کاملScalable Parallel Newton-Krylov Solvers for Discontinuous Galerkin Discretizations
We present techniques for implicit solution of discontinuous Galerkin discretizations of the Navier-Stokes equations on parallel computers. While a block-Jacobi method is simple and straight-forward to parallelize, its convergence properties are poor except for simple problems. Therefore, we consider Newton-GMRES methods preconditioned with block-incomplete LU factorizations, with optimized ele...
متن کاملComputing rational Gauss-Chebyshev quadrature formulas with complex poles
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary complex poles outside [−1, 1]. This algorithm is based on the derivation of explicit expressions for the Chebyshev (para-)orthogonal rational functions.
متن کاملCentroidal Mean Derivative - Based Closed Newton Cotes Quadrature
In this paper, a new scheme of the evaluation of numerical integration by using Centroidal mean derivative based closed Newton cotes quadrature rule (CMDCNC) is presented in which the centroidal mean is used for the computation of function derivative. The accuracy of these numerical formulas are higher than the existing closed Newton cotes quadrature (CNC) fromula. The error terms are also obta...
متن کاملAnalysis of errors in some recent numerical quadrature formulas for periodic singular and hypersingular integrals via regularization
Article history: Received 21 February 2013 Received in revised form 13 February 2014 Accepted 18 February 2014 Available online 19 March 2014
متن کامل